A Certificate for Semidefinite Relaxations in Computing Positive Dimensional Real Varieties
نویسندگان
چکیده
For an ideal I with a positive dimensional real variety VR(I), based on moment relaxations, we study how to compute a Pommaret basis which is simultaneously a Gröbner basis of an ideal J generated by the kernel of a truncated moment matrix and satisfying I ⊆ J ⊆ I(VR(I)), VR(I) = VC(J) ∩ R. We provide a certificate consisting of a condition on coranks of moment matrices for terminating the algorithm. For a generic δ-regular coordinate system, we prove that the condition is satisfiable in a large enough order of moment relaxations.
منابع مشابه
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones
This paper is based on a recent work by Kojima which extended sums of squares relaxations of polynomial optimization problems to polynomial semidefinite programs. Let E and E+ be a finite dimensional real vector space and a symmetric cone embedded in E ; examples of E and E+ include a pair of the N -dimensional Euclidean space and its nonnegative orthant, a pair of the N -dimensional Euclidean ...
متن کاملSums of Squares, Moment Matrices and Optimization over Polynomials
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and inequalities, which is NP-hard in general. Hierarchies of semidefinite relaxations have been proposed in the literature, involving positive semidefinite moment matrices and the dual theory of sums of squares of polynomials. We present these hierarchies of approximations and their main...
متن کاملPositive polynomials on unbounded equality-constrained domains
Certificates of non-negativity are fundamental tools in optimization. A “certificate” is generally understood as an expression that makes the non-negativity of the function in question evident. Some classical certificates of non-negativity are Farkas Lemma and the S-lemma. The lift-and-project procedure can be seen as a certificate of non-negativity for affine functions over the union of two po...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملSe p 20 08 THETA BODIES FOR POLYNOMIAL IDEALS
A polynomial ideal I ⊆ R[x] is THk-exact if every linear polynomial that is non-negative over VR(I), the real variety of I , is a sum of squares of polynomials of degree at most k modulo I . Lovász recognized that a graph is perfect if and only if the vanishing ideal of the characteristic vectors of its stable sets is TH1-exact, and asked for a characterization of ideals which are TH1-exact. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012